Multiple Space-Time Scale Analysis For Interacting Branching Models
نویسندگان
چکیده
منابع مشابه
Multiple space-time scale analysis for interacting branching models
We study a class of systems of countably many linearly interacting diffusions whose components take values in [0,∞) and which in particular includes the case of interacting (via migration) systems of Feller’s continuous state branching diffusions. The components are labelled by a hierarchical group. The longterm behaviour of this system is analysed by considering space-time renormalised systems...
متن کاملAnalysis of Hierarchical Bayesian Models for Large Space Time Data of the Housing Prices in Tehran
Housing price data is correlated to their location in different neighborhoods and their correlation is type of spatial (location). The price of housing is varius in different months, so they also have a time correlation. Spatio-temporal models are used to analyze this type of the data. An important purpose of reviewing this type of the data is to fit a suitable model for the spatial-temporal an...
متن کاملLarge Space-Time Scale Behavior of Linearly Interacting Diffusions
We study a renormalization transformation arising in an infinite system of interacting diffusions. The components of the system are labeled by the N -dimensional hierarchical lattice (N ≥ 2) and take values in a compact convex set D ⊂ Rd (d ≥ 1). Each component starts at some θ ∈ D and is subject to two motions: (1) an isotropic diffusion according to a local diffusion rate g : D → [0,∞) chosen...
متن کاملHierarchically interacting Fleming-Viot processes with selection and mutation: Multiple space time scale analysis and quasi-equilibria
Genetic models incorporating resampling and migration are now fairly well-understood. Problems arise in the analysis, if both selection and mutation are incorporated. This paper addresses some aspects of this problem, in particular the analysis of the long-time behaviour before the equilibrium is reached (quasi-equilibrium, which is the time range of interest in most applications).
متن کاملTime-Space Tradeoffs for Branching Programs
We obtain the first non-trivial time-space tradeoff lower bound for functions f : {0, 1}n → {0, 1} on general branching programs by exhibiting a Boolean function f that requires exponential size to be computed by any branching program of length (1 + ǫ)n, for some constant ǫ > 0. We also give the first separation result between the syntactic and semantic read-k models [BRS93] for k > 1 by showin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 1996
ISSN: 1083-6489
DOI: 10.1214/ejp.v1-14